RETRIEVE A SPERNER MAP FROM A SPERNER MATROID
نویسندگان
چکیده
منابع مشابه
Sperner capacities
We determine the asymptotics of the largest family of qualitatively 2{independent k{ partitions of an n{set, for every k > 2. We generalize a Sperner-type theorem for 2{partite sets of KK orner and Simonyi to the k{partite case. Both results have the feature that the corresponding trivial information-theoretic upper bound is tight. The results follow from a more general Sperner capacity theorem...
متن کاملSperner Oiks
The idea of “Lemke pivoting in a family of oiks (Euler complexes)” generalizes, and abstracts to pure combinatorics, the Lemke-Howson exchange algorithm for finding a Nash equilibrium in bimatrix games, as well as the classical algorithm for finding the properly colored room in Sperner’s Lemma. Given a “room-partitioning”, this algorithm finds another (distinct) room-partitioning by traversing ...
متن کاملSperner theory pdf
In 1928 Emanuel Sperner presented a simple. Cohen, On the Sperner lemma, J. Theory 2 1967.Abstract. This paper presents elementary combinatorial proofs of Sperners. Advanced topics like degree theory or homology. Before beginning, it.ple combinatorial result known as Sperners lemma. As motivation, we examine a special case of Sperners lemma. Vick, Homology Theory.extremal two-part Sperner famil...
متن کاملTilted Sperner families
Let A be a family of subsets of an n-set such that A does not contain distinct sets A and B with |A\B| = 2|B\A|. How large canA be? Our aim in this note is to determine the maximum size of such an A. This answers a question of Kalai. We also give some related results and conjectures.
متن کاملSaturating Sperner Families
A family F ⊆ 2[n] saturates the monotone decreasing property P if F satisfies P and one cannot add any set to F such that property P is still satisfied by the resulting family. We address the problem of finding the minimum size of a family saturating the k-Sperner property and the minimum size of a family that saturates the Sperner property and that consists only of l-sets and (l + 1)-sets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2006
ISSN: 1027-5487
DOI: 10.11650/twjm/1500403809